• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    The invention relates to a method for a video encoder to select data from a set of image blocks, each block being associated with a frame, a counter value and cost, the method comprising: selecting for a target block from the set of image blocks calculating the respective counter values and the respective costs of other blocks from the set of picture blocks, the other blocks being connected to the same frame as the target block or to a previous frame; and selecting from the other blocks a reference block having the lowest cost and counter value according to predefined criteria. The invention also relates to a computer program product for performing the method and to a video encoder.
    公开号:BE1022688B1
    申请号:E2014/0012
    申请日:2014-01-09
    公开日:2016-07-18
    发明作者:Thijs Koen Vermeir
    申请人:Barco Nv；
    IPC主号:
    专利说明:

    Efficient error recovery.
    The present invention relates to efficient error recovery in systems and to methods involved in encoded video streams, as well as to an encoder and to software for carrying out such methods when they are executed on a processing device, said software being executed on a non volatile signal storage medium is stored.
    Compression is a method to reduce the size of a data collection, in particular video data, so that the collection has less bandwidth. required during transfer. The compressed data stream can be reconstructed by using different types of prediction. The data collection is conventionally divided into I and P frames, such that the I frames contain the currently compressed data, while the P frames are predicted from the I frames. This concept was initially introduced to enable reading of local digital media without first having to decode the entire data collection.
    Nowadays, large amounts of data are transmitted over imperfect channels over a network and there is an increasing need for error recovery of network transfer errors. Applications with high quality requirements, for example industrial process control, traffic control, digital control rooms, audio applications, data compression or any other application that sets high data quality requirements often use lossless compression. Many such applications also require a recovery of artifacts within a certain maximum time limit.
    Existing video codec standards (eg h.264, MPEG4, MPEG2, ...) support lossless compression in theory, but their error recovery solutions are complex and costly. An example of this is given in US 7,899,119, which discloses the manner in which the image is to be divided into regions and so that only the regions with significant information will use the complex error correction code.
    It is an object of embodiments of the present invention to provide a simple error recovery method, wherein it is possible to set the error recovery time in advance and adapt it to the displayed content.
    According to an aspect of the present invention, a method for a video encoder is provided to select data from a set of image blocks, wherein each block is connected to a frame, a counter value, and cost, the method comprising: for a target block from the set calculating from image blocks the respective counter values and the respective costs of other blocks from the set of image blocks, the other blocks being connected to the same frame as the target block or to a previous frame; and selecting from the other blocks a reference block having the lowest cost and counter value, according to predefined criteria. The counter value, or lifespan, of a block may in particular represent the time from which the block is based on prediction, thus corresponding to the maximum age of an artifact that may have occurred since the last unpredicted data update for that block . The counter value can be expressed as an elapsed time, a number of intermediate frames or any other suitable unit.
    This method prefers selection of the blocks with the smallest (or at least smaller) counter values, so that the data provided will be as new as possible. Each block can be connected to a specific position in the frame. The other blocks that are considered for selection are preferably adjacent blocks, ie, blocks whose position in the frame is adjacent to the position of the target block, or the block that is in the same spatial position as the target frame in the previous block.
    In an embodiment of the method according to the present invention, each block is connected to a maximum counter value, so that selection can only take place with blocks that do not exceed the maximum counter value. The maximum counter value means that it is possible to pre-set the maximum age of the data to be selected.
    In one embodiment, the method of the present invention further comprises using the reference block to predict data to be transferred for the target block or, if no data meets the criteria, to transfer unpredicted data for the target block. If the maximum age of all blocks is exceeded, the encoder should no longer use any block for prediction, but instead the data is transmitted as such (raw, compressed, ...). The unpredicted information is the data refresh, so if the data is lost, it will be restored at this point. The interval of this renewal will be pre-set by the lifespan mentioned above.
    In an embodiment of the method according to the present invention, the counter value of a block in a previous time position is increased by a number of counter units prior to calculating the counter value. This is the way in which the counter value is increased.
    In an embodiment of the method according to the present invention, the counter value units are frame counts. This is a suitable counter selection when operating with streaming frames.
    In an embodiment of the method according to the present invention, each of the other blocks is a block above or on the left side of the target block or a counterpart of the target block in the preceding frame. A selection is examined instead of checking all neighbors.
    In one embodiment of the method according to the present invention, the cost of a block is based on a number of colors in the block. In this way it is possible to give preference to selection of blocks with few colors or with many colors.
    In one embodiment of the method according to the present invention, the counter value of a block is based on statistical data that relates to network quality and bandwidth. This is a way to further adapt the method to the current system by making the counter units dependent on the previous network performance.
    In an embodiment of the method according to the present invention, the counter value for a block located in another frame is increased. In this way, preference will be given to blocks within the same frame for selection.
    According to an aspect of the present invention, there is provided a computer program product comprising code means adapted to cause a processor to perform the method as described above.
    According to an aspect of the present invention, there is provided a device which has a first interface adapted to receive a video signal, coding means for coding the video signal, and a second interface adapted to transmit the coded video signal carrying, the processing means is adapted to select data from a set of image blocks, each block being connected to a frame, a counter value and cost, and to provide a respective block from the set of image blocks with the respective counter values and the calculate respective costs of other blocks from the set of image blocks, the other blocks being connected to the same frame as the target block or to a previous frame, and to a reference block having the lowest cost and counter value from the other blocks, according to predefined criteria.
    In an embodiment of the device according to the present invention, the coding means are further adapted to use the reference block to predict data to be transmitted for the target block and, if no data meets the criteria, to transfer unpredicted data for the target block .
    Brief description of the drawings
    These and other technical features and advantages of embodiments of the present invention will now be described in more detail with reference to the accompanying figures, in which:
    Figure 1 is an illustration of a frame divided into macro blocks;
    Figure 2 is an illustration of a series of conventional I and P frames;
    Figure 3 is an illustration of a series of frames in an embodiment of the present invention;
    Figure 4 is an illustration of an embodiment of the present invention;
    Figure 5 is an illustration of an embodiment of the present invention;
    Figure 6 is an illustration of an embodiment of the present invention;
    Figure 7 is an illustration of an embodiment of the present invention;
    Figure 8 is an illustration of an embodiment of the present invention;
    Figure 9 is an illustration of an embodiment of the present invention.
    The drawings are schematic illustrations and non-limiting and should not be construed as representing an exact scale of the physical objects. The present invention is not limited to the disclosed embodiments. Throughout the description, the same reference numerals are used for the same elements of the present invention throughout the text. It will be understood that the term "comprising" used in the claims is not to be construed as being limited to the agents listed thereafter, but is to be construed as specifying the presence of the stated characteristics and not the presence or additions of one or more features exclusively. Even when the text refers to video compression, there should be no limitation on using the present invention in other areas where fast error recovery is desired.
    Figure 1 shows an example of one embodiment of the invention. A frame 10 is subdivided into macro blocks with different contents. The diagonally hatched areas represent significance here, so that the significance of, for example, macroblock 11 is higher or lower than that of macroblock 12. An interest area would be a collection of blocks, all of which contain a similar type of content, such as the gray macroblocks in Figure 1. The blocks in Figure 1, which contain a striped pattern, could together form another area of interest. This is a common situation for many applications where controlled error recovery is required. An example could be traffic control, where the continuously varying road can be one area of interest, while the more static surrounding landscape could be another area of interest. With such a categorization of blocks, it is possible to connect all blocks of one area of interest with the same defined error recovery rate. A region with more critical information could then be given a higher error recovery speed, while a less important area of interest could be given a lower error recovery speed. This is only an example and is not to be construed as limiting the invention.
    Figure 2 shows a series of intraframes 20, called I, and predicted frames 21, called P, which are distributed along a time axis 24. The y-axis 25 shows the required bandwidth for each frame. The I-frames 20 are transmitted in an unpredicted form (compressed, rough, ...) and are highly bandwidth-consuming. It is therefore a priority to reduce the presence of I-frames. Since the bandwidth usage is considerably greater than for the P-frames, the overall operation will be characterized by a basic level of low bandwidth usage (the P-frames) and then occasionally peaks with very high bandwidth usage (the I-frames). This leads to an unstable operation that could compromise the robustness of the network performance.
    The P-frames 24 are predicted from the I-frame of the same group of images (GOP) 22. Since I-frames use a lot of bandwidth, it is preferable to keep their frequency low. On the other hand, this is also a limitation for the speed of error recovery. The arrow 23 indicates the longest possible time that would have been required to recover from an error in this example. In general, the error recovery speed can only be changed for one fixed interval and the frame content is not considered.
    Figure 3 illustrates a series of frames according to an embodiment of the present invention. There is only one type of frames 30, here called F, distributed along the time axis 24. Their bandwidth consumption is shown on the bandwidth axis 25. The F-frames generally consume slightly more bandwidth than the P-frames in Figure 2 and less bandwidth than the I-frames in Figure 2. This is due to the fact that embodiments of the present invention no longer provide reference data by means of full I-frames, but with individual I-blocks. The I blocks are distributed across all F frames, rather than being collected in specific I frames. This results in the bandwidth consumption being spread out to a stable value without peaks.
    The service life associated with the F-frames is set to a maximum value in light of a specific intended bandwidth consumption. If there is still available bandwidth, a block with higher costs but with a shorter lifespan can be used to further shorten the lifespan. The invention does not necessarily bring about a reduction in the overall average bandwidth usage, but the advantage is peak-free operation where the error recovery speed can be preset and furthermore this speed can be increased without requiring more bandwidth.
    Figure 4 shows an example of an embodiment of the present invention in which the adjacent (in space and time) blocks of a selected block 40 are evaluated for cost and lifetime. This lifespan can in particular be the time from which the block is based on prediction, which thus corresponds to the maximum age of an artifact that has intervened since the last update of unpredicted data for that block. The service life is indicated by a number within the blocks and the costs will depend on various factors, such as the color of the blocks. In this example, the color of the adjacent block in relation to the currently examined block is important, e.g., whether the colors are the same or not. For example, if a different color means that additional information (compared to the selected block 40) needs to be transferred, this would consume more bandwidth and increased costs.
    In the example of Figure 4, it is left 41, upper 42, and previous 43 blocks that are evaluated for selection. In particular, this selection can be performed to determine an adjacent block, on the basis of which the selected block 40 can be predictively coded, or to determine that a "renewal" in the form of a transfer of the original data, such as received has become necessary. If none of these blocks is suitable, the NUL alternative 44 is also available. If block 41 or 42 is selected, block 40 obtains the lifetime of the selected block. If the block 43 is selected from a previous frame, the block 40 obtains the lifetime 43 + 1 lifetime unit. In the case where all lifetimes of the adjacent blocks are too high, block 40 can choose the NUL alternative. This would imply that no prediction is made, but block 40 is transmitted as received (raw, compressed or in any suitable format). This means that the NUL operator always means high costs, since the NUL operator consumes a large amount of bandwidth. If the ZERO operator were used, the lifetime of block 40 would be reset to its initial value or lowest value.
    Alternatively, it may be possible to transfer the non-predicted data, if sufficient bandwidth is available. However, in the example of Figure 4, the block 42 will be chosen as the predictor. This block has the lowest lifespan and also the same color as block 40, which color would imply lower costs than the other color of block 41 or block 43.
    In the example of Figure 4, it is assumed that none of the adjacent lifetimes exceed the permitted maximum lifespan for block 40. The method in the example presented is sequential; an overview is given in Table 1, which must be read from top to bottom. The first step is to evaluate the block 41 on the left side of the block 40 to be examined. Since its lifespan is within limits and it is the first choice, it will be selected provisionally. The block 42 above block 40 is then evaluated. Since this block has a lower lifespan and lower costs than the left block, this block will replace the left block in the selection. The preceding block 43 has a service life of 2 and, since this block is in the previous frame, one unit will be added. The costs of the preceding block 43 are high, since it has a different color. It will therefore have a longer service life and higher costs than the currently selected block and will not be selected. Since there is a candidate within the maximum lifespan, the NUL operator will not be chosen.
    Table 1
    The above example should not be seen as a limitation for the invention, but as an explanation case to describe the evaluation principle.
    Figure 5 shows an example of a pseudo code of one embodiment of the present invention. The "checkCandidate" procedure includes the rules for how the costs and the lifetime are set for each adjacent block. The "predict Macroblock" procedure corresponds to analyzing the adjacent blocks according to the example of Figure 4.
    Figures 6 to 9 show an illustration of an example of an embodiment of the present invention, wherein all blocks of a frame containing 4 blocks are evaluated in 4 consecutive frames. In this presentation it is clearer how analyzing all blocks of one frame affects the result for the other blocks, as their environment is constantly changing. This illustrates the ability of the invention to find the most suitable candidate according to the criteria of a system state at the exact time of evaluation. Figures 6, 7, 8 and 9 correspond to frame 1, 2, 3 and 4, respectively.
    Figures 6, 7, 8 and 9 are constructed with the same layout and Figure 6 will serve as an illustrative example. Block 60 has the highest service life of the respective blocks in the frame. This corresponds in figures 7, 8 and 9 to blocks 70, 80 and 90 and so on. Block 61 is the state of the previous frame.
    Row 60 to 65, separated by dashed lines, each represent an evaluation of a block. Row 66 is the final state when all blocks of frame 1 have been analyzed.
    Starting with row 62, the first frame 67 shows the initial value of incoming frame 1. Note that the top right block 671 has a different color from the other blocks. The second frame 68 indicates with a checked pattern the block to be examined in this row (here the top left block). The blocks in 69 are the spatially adjacent neighbors on the left side of and above the block under investigation. If none of such neighbors are available, they are marked with a cross. Block 691 is the previous block in the same position as the block under investigation, with the one additional unit added. Block 692 is the NUL operator. Below the blocks 69, 691 and 692, the block to be selected is indicated by a dotted pattern.
    The corresponding explanation applies to rows 63-65 in Figure 6. The corresponding explanation of Figure 6 also applies, mutatis mutandis, to Figures 7 to 9.
    In row 62, the first block examined is that of the upper left corner, indicated by 68. Since there is no block on the left side of or above the selection, both blocks 69 are indicated by a cross. The previous block 691 has a lifetime 1 (increase by 1 from 0 to 61). Since this does not exceed the maximum lifetime 2 specified in 60, 691 will be selected. This is indicated by the dotted pattern in 691. The NUL operator is connected to a high bandwidth consumption and is assumed to have much higher costs than the predicted blocks and will not be chosen in most cases. However, there might be an option to choose the ZERO operator if bandwidth is available. Row 63 shows how the updated state of the frame and the previously evaluated block (top left corner) is now with the lifetime 1 of the predictor.
    A few special cases in Figures 6 to 9 will now be explained. When evaluating the colored block in row 65, it is assumed that another color is too expensive to choose, and therefore the left-hand block will be chosen since the lifetimes are the same. In Figure 7 in row 75, it is assumed that the cost of the colored block is so high that the left neighbor is chosen, even if it has a longer life. This can be OK, since the maximum lifespan (with 6 displayed at 70) has not been exceeded. In Figure 8, row 82, the only available block 891 has a lifetime of 3. The block to be examined is indicated in 88 by the top left block. This block has a maximum lifetime of 2 according to 80, and therefore cannot be selected, and the selection will be the NUL operator 892. The first block of row 83 shows the updated state of the block; the left upper block evaluated in the previous step is now set to its initial value 0.
    The various embodiments of the method of the present invention can be implemented as a video encoder either free-standing or embedded. Such a video coding device is a device with a first interface adapted to receive a video signal, coding means for coding the video signal, and a second interface adapted to transmit the coded video signal, the processing means being adapted to select data from a set of image blocks, wherein each block is connected to a frame, a position, a counter value and costs, and to calculate the counter value of blocks in the same frame or in a previous frame for each block and to select the block , which has the lowest costs and counter value, according to predefined criteria. One or both of the interfaces can include a combination of hardware and software. The processing means is preferably adapted to communicate with the first and second interfaces.
    The coding means may further be adapted to use the reference block to predict data to be transferred for the target block, and if no data meets the criteria, to transfer unpredicted data for the target block.
    The coding means may be implemented as a combination of one or more dedicated hardware components (such as ASICs), configurable logic components (such as FPGAs) or programmable components (such as microprocessors).
    The present invention also relates to a computer program product optionally stored on a non-volatile computer-readable medium comprising code means adapted to cause a processor to perform the methods as described above. In particular, the present invention comprises a computer program product, which comprises software, which has code segments, which upon execution on a processing means provide a method for a video encoder to select data from a set of image blocks, each block being connected to a frame , a counter value and costs. The software can be adapted to, upon execution on a processing means, means for a target block among the set of image blocks to calculate the respective counter values and the respective costs of other blocks from the set of image blocks. The software may be adapted to cause, upon execution on a processing means, that the other blocks are connected to the same frame as the target block or to a previous frame; and can select a reference block with the lowest cost and counter value from the other blocks, according to predefined criteria.
    The software can be adapted to effect, upon execution on a processing means, that each block is connected to a maximum counter value, so that selection can only take place with blocks that do not exceed the maximum counter value.
    The software may be adapted to predict on data to be transmitted for the target block when executed on a processing means for using the reference block, or if no data meets the criteria, to transfer unpredicted data for the target block.
    The software can be adapted to cause, upon execution on a processing means, that the counter value of a block in a previous time position is increased by a number of counter units prior to calculating the counter value.
    The software can be adapted to cause the counter value units to be frame counts when executed on a processing means.
    The software may be adapted to cause, upon execution on a processing means, that each of the other blocks is a block above or to the left of the target block or a counterpart of the target block in the preceding frame.
    The software can be adapted to cause, when executed on a processing means, that the cost of a block is based on a number of colors in the block.
    The software can be adapted to cause, upon execution on a processing means, that the calculation of the counter value of a block is based on statistical data relating to network quality and bandwidth.
    The software can be adjusted to cause the counter value for a block located in a different frame to be increased.
    The computer program product mentioned above can be stored on a non-volatile signal storage medium, such as a solid state memory, such as a flash memory or USB memory, a magnetic hard disk, a magnetic tape, an optical storage medium, such as a CD-ROM or a DVD ROM, etc. The non-volatile signal storage means can preferably be read by a computer or machine.
    Although the invention is described herein with reference to specific embodiments, this is done to illustrate and not limit the invention, the full scope of which is defined by the appended claims.
    权利要求:
    Claims (10)
    [1]
    Conclusions
    A method for a video encoder for selecting data from a set of image blocks, each block being connected to a frame, a counter value and costs, the method comprising: - calculating the respective counter values for a target block from the set of image blocks and the respective costs of other blocks from the set of image blocks, the other blocks being connected to the same frame as the target block or to a previous frame; and - selecting from the other blocks a reference block which has the lowest cost and / or the lowest counter value; wherein each of the other blocks is a block above or to the left of the target block or a counterpart of the target block in the preceding frame; wherein each block is connected to a maximum counter value, so that selection can only take place with blocks that do not exceed the maximum counter value; and wherein the NULL alternative is selected if the maximum counter value is exceeded in each of the other blocks.
    [2]
    The method of claim 1, further comprising using the reference block to predict data to be transferred for the target block or, if no data meets the criteria, transferring non-predicted data for the target block.
    [3]
    A method according to any of the preceding claims, wherein the counter value of a block in a previous time position is increased by a number of counter units prior to calculating the counter value.
    [4]
    The method of any one of the preceding claims, wherein the counter value units are frame counts.
    [5]
    The method of any one of the preceding claims, wherein the cost of a block is based on a number of colors in the block.
    [6]
    Method according to one of the preceding claims, wherein the calculation of the counter value of a block is based on statistical data that relates to network quality and bandwidth.
    [7]
    Method according to one of the preceding claims, wherein the counter value for a block located in another frame is increased.
    [8]
    A computer program product comprising code means adapted to cause a processor to perform the method according to any one of the preceding claims.
    [9]
    An apparatus comprising a first interface adapted to receive a video signal, encoding means for encoding the video signal, and a second interface adapted to transmit the encoded video signal, a processing means adapted to transmit data from a set of image blocks, each block being connected to a frame, a counter value and cost, and to select the respective counter values and the respective costs of other blocks from the set of image blocks for a target block from the set of image blocks calculating, wherein the other blocks are connected to the same frame as the target block or to a previous frame, and to select from the other blocks a reference block having the lowest cost and / or the lowest counter value; wherein each of the other blocks is a block above or to the left of the target block or a counterpart of the target block in the preceding frame; wherein each block is connected to a maximum counter value, so that selection can only take place with blocks that do not exceed the maximum counter value; and wherein the NULL alternative is selected if the maximum counter value is exceeded in each of the other blocks.
    [10]
    Device according to claim 9, wherein the coding means are further adapted to use the reference block to predict data to be transferred for the target block and, if no data meets the criteria, to transfer unpredicted data for the target block.
    类似技术:
    公开号 | 公开日 | 专利标题
    TWI504237B|2015-10-11|Buffering prediction data in video coding
    JP6430961B2|2018-11-28|Efficient scalable coding concept
    RU2603552C2|2016-11-27|Image decoding method, image encoding method, image decoding device, image encoding device and image encoding and decoding device
    JP6523324B2|2019-05-29|Image encoding / decoding method and apparatus
    US10547838B2|2020-01-28|Encoding and decoding a video frame in separate processing units
    US9071842B2|2015-06-30|Detection of video feature based on variance metric
    JP4313710B2|2009-08-12|Image encoding method and image decoding method
    TWI609585B|2017-12-21|Image coding method, image decoding method, image coding apparatus, image decoding apparatus, and image coding and decoding apparatus
    JP6240266B2|2017-11-29|Encoding and decoding method and apparatus
    EP3007454A1|2016-04-13|Data decoding method, data decoding apparatus, and data transmitting method
    TW201316779A|2013-04-16|Image coding method, image decoding method, image coding apparatus, image decoding apparatus, and image coding and decoding apparatus
    CN103843349A|2014-06-04|Methods and apparatuses for encoding and decoding video using periodic buffer description
    CN104335582A|2015-02-04|Video encoding method, video decoding method, video encoding device and video decoding device
    TWI546778B|2016-08-21|An image coding method, an image decoding method, an image coding apparatus, and an image decoding apparatus
    CN103828373A|2014-05-28|Image encoding method, image encoding device, image decoding method, image decoding device, and image encoding/decoding device
    TWI575947B|2017-03-21|Image coding method, image decoding method, image coding apparatus, and image decoding apparatus
    US10715822B2|2020-07-14|Image encoding method and encoder
    BE1022688B1|2016-07-18|EFFICIENT ERROR RECOVERY
    US10158863B2|2018-12-18|Image coding apparatus, image coding method, and recording medium, and image decoding apparatus, image decoding method, and recording medium
    CN105828080B|2020-02-14|Image coding and decoding method and device
    KR101602871B1|2016-03-11|Method and apparatus for data encoding, method and apparatus for data decoding
    EP1601206A1|2005-11-30|Image decoding device, image encoding device, and method thereof
    JP2004274734A|2004-09-30|Picture decoding apparatus, picture encoding apparatus, and method thereof
    TW202005371A|2020-01-16|Video coding and decoding
    JP2005079965A|2005-03-24|Representative point information coding method and representative point information decoding method
    同族专利:
    公开号 | 公开日
    US10063853B2|2018-08-28|
    US20150172651A1|2015-06-18|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    US6025888A|1997-11-03|2000-02-15|Lucent Technologies Inc.|Method and apparatus for improved error recovery in video transmission over wireless channels|
    WO2004002150A1|2002-06-25|2003-12-31|Motorola, Inc., A Corporation Of The State Of Delaware|Video encoder and method for encoding video frames|
    US20100128788A1|2004-12-08|2010-05-27|Nvidia Corporation|System and method for intra refresh implementation with pseudo random number generation|
    US20080247469A1|2007-04-04|2008-10-09|Sarat Chandra Vadapalli|Method and device for tracking error propagation and refreshing a video stream|
    JP3219403B2|1989-05-10|2001-10-15|キヤノン株式会社|Image storage device|
    DE4344924A1|1993-12-30|1995-08-10|Thomson Brandt Gmbh|Method and device for motion estimation|
    US7068825B2|1999-03-08|2006-06-27|Orametrix, Inc.|Scanning system and calibration method for capturing precise three-dimensional information of objects|
    US7310808B2|2002-03-29|2007-12-18|Sony Corporation|Method of and apparatus for supporting and enabling the selection and mixing of multiple streams of audio/video data from multiple sources within a receiving device allowing external control|
    US7382903B2|2003-11-19|2008-06-03|Eastman Kodak Company|Method for selecting an emphasis image from an image collection based upon content recognition|
    US7706443B2|2005-03-11|2010-04-27|General Instrument Corporation|Method, article of manufacture, and apparatus for high quality, fast intra coding usable for creating digital video content|
    DE102005029127A1|2005-06-23|2007-04-19|On Demand Microelectronics Ag|Method and apparatus for optimized predictive video coding|
    JP4764136B2|2005-10-31|2011-08-31|富士通セミコンダクター株式会社|Moving picture coding apparatus and fade scene detection apparatus|
    US8676219B2|2007-04-13|2014-03-18|Hart Communication Foundation|Combined wired and wireless communications with field devices in a process control environment|
    US8300958B2|2007-07-11|2012-10-30|Samsung Electronics Co., Ltd.|System and method for detecting scrolling text in mixed mode film and video|
    WO2010137086A1|2009-05-26|2010-12-02|パナソニック株式会社|Moving image processing device and moving image processing method|
    US20120215560A1|2010-07-21|2012-08-23|dbMotion Ltd.|System and methods for facilitating computerized interactions with emrs|
    KR101736793B1|2010-12-29|2017-05-30|삼성전자주식회사|Video frame encoding device, encoding method thereof and operating method of video signal transmitting and receiving system including the same|
    US8768020B2|2011-12-29|2014-07-01|Tektronix, Inc.|Method of detecting visual stress and photosensitive epilepsy triggers in video and mitigation device|
    US9129188B2|2012-06-22|2015-09-08|Canon Kabushiki Kaisha|Image processing apparatus and control method thereof|
    法律状态:
    优先权:
    申请号 | 申请日 | 专利标题
    US14/107,257|US10063853B2|2013-12-16|2013-12-16|Efficient error recovery|
    US14107257|2013-12-16|
    [返回顶部]